Channel-optimized scalar quantizers with erasure correcting codes

نویسندگان

  • Dengyu Qiao
  • Ye Li
چکیده

This paper investigates the design of channel-optimized scalar quantizers with erasure correcting codes over binary symmetric channels (BSC). A new scalar quantizer with uniform decoder and channel-optimized encoder aided by erasure correcting code is proposed. The lower bound for performance of the new quantizer with complemented natural code (CNC) index assignment is given. Then, in order to approach it, the single parity check code and corresponding decoding algorithm are added into the new quantizer encoder and decoder, respectively. Analytical results show that the performance of the new quantizers with CNC is better than that of the original quantizers with CNC and natural binary code (NBC) when crossover probability is at a certain range.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple Description Quantizer Design Using A Channel Optimized Quantizer Approach

This paper extends the channel optimized quantization scheme of Farvardin and Vaishampayan [1] to two parallel channels. The extended multiple-channel optimized quantizer design (MCOQD) framework is applied to discrete memoryless channels with erasures. The resultant MCOQD subsumes the multiple description scalar quantizer (MDSQ) design of Vaishampayan [2]. While MDSQ is suited to only “on-off”...

متن کامل

Improving the Error Resilience of G.711.1 Speech Coder with Multiple Description Coding

This thesis devises quantization and source-channel coding schemes to increase the error robustness of the newly standardized ITU-T G.711.1 speech coder. The schemes employ Gaussian mixture model (GMM) based multiple description quantizers (MDQ). The thesis reviews the literature focusing on GMM based quantization, MDQ, and GMM-MDQ design methods and bit allocation schemes. GMM-MDQ are then des...

متن کامل

On the erasure-correcting capabilities of low-complexity decoded LDPC codes with constituent Hamming codes

Low-density parity-check (LDPC) codes can be constructed using constituent block codes other than single parity-check (SPC) codes. This paper considers random LDPC codes with constituent Hamming codes and investigates their asymptotic performance over the binary erasure channel. It is shown that there exist Hamming code-based LDPC codes which, when decoded with a low-complexity iterative algori...

متن کامل

Construction and Performance Analysis of BIBD-QC-LDPC Codes for Correcting Erasure-Bursts

This paper presents a novel approach for constructing structured regular QC-LDPC codes based on a special type of combinatorial designs,known as the balanced incomplete block design (BIBD).The code design approach based on the technology of block cyclic shift and dispertion (BCSD) for correcting erasure-bursts over the binary bursts erasure channel (BBEC). Furthermore, the Tanner graph of the c...

متن کامل

n-Channel Multiple Descriptions: Theory and Constructions

We present new achievable rate regions and code constructions for the symmetric n-channel Multiple Descriptions (MD) coding problem [1] for n > 2. Our approach is inspired by unexplored connections between MD and the problem of distributed source coding [2, 3]. For illustrative clarity, we restrict our focus to the important special case relating to (n, k) source-channel erasure codes [4]. This...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • EURASIP J. Wireless Comm. and Networking

دوره 2014  شماره 

صفحات  -

تاریخ انتشار 2014